class Solution {
public:
    int minPathSum(vector<vector<int>>& matrix) {
        int m = matrix.size(), n = matrix[0].size();
        vector<vector<int>> dp(m+1, vector<int>(n+1, 0x3f3f3f3f));
        for (int i = 1; i <= m; ++i) {
            for (int j = 1; j <= n; ++j) {
                dp[i][j] = matrix[i-1][j-1];
                if (i == 1 && j == 1) continue;
                dp[i][j] += min(dp[i-1][j], dp[i][j-1]);
            }
        }
        return dp[m][n];
    }
};